Renata Wassermann on Structured Belief Bases
نویسنده
چکیده
Most existing approaches to belief revision describe the behaviour of a highly idealized rational agent. In operations of belief change for more realistic agents, usually only a small part of an agent's beliefs is accessed at one time. This should be taken into account if we are looking for cognitively more appropriate operations. Furthermore, it makes implementation more feasible. In this paper we show how extra structure of belief bases can be used for implementing local change as deened in Hansson and Wassermann, 1999], where only the relevant part of an agent's beliefs is considered. Some ideas for adding structure to belief bases are presented. Structured belief bases can be seen as graphs, where each node is a belief and two nodes are adjacent if and only if they are related. We also deene some notions of relatedness.
منابع مشابه
On Structured Belief Bases -
In this paper some ideas for adding structure to belief bases are presented. Structured belief bases can be seen as graphs, where each node is a belief and two nodes are adjacent if and only if they are related. Some notions of relatedness are deened. We then show how this extra structure can be used for implementing local change as deened in HW98].
متن کاملOn Structured Belief Bases - Preliminary
In this paper some ideas for adding structure to belief bases are presented. Structured belief bases can be seen as graphs, where each node is a belief and two nodes are adjacent if and only if they are related. Some notions of relatedness are deened. We then show how this extra structure can be used for implementing local change as deened in HW98].
متن کاملBase Revision in Description Logics - Preliminary Results
Belief Revision deals with the problem of adding new information to a knowledge base in a consistent way. The theory has been developed having in mind classical logics. In this paper, we show some problems of applying belief revision methods directly to ontologies represented in description logics and propose new operations that overcome these problems.
متن کاملBetween Belief Bases and Belief Sets: Partial Meet Contraction
In belief revision, the result of a contraction should be a logically closed set (closure) such that the input is not inferred (success). Traditionally, these two postulates depend on the same consequence operator. The present work investigates the consequences of using two different consequence operators for each of these desiderata: the classic Cn to compute success and a second weaker operat...
متن کامل